Simple Braids for Surface Homeomorphisms
نویسنده
چکیده
Let S be a compact, oriented surface with negative Euler characteristic and let f : S → S be a homeomorphism isotopic to the identity. If there exists a periodic orbit with a non-zero rotation vector (~ p, q), then there exists a simple braid with the same rotation vector.
منابع مشابه
Simple Conjugacy Invariants for Braids
We define simple conjugacy invariants of braids, which we call turning numbers, and investigate their properties. Since our motivation comes from the investigation of periodic orbits of orientation preserving disk homeomorphisms, turning numbers work best for braids with the cyclic permutation, especially for positive permutation cyclic braids.
متن کاملThe generalized Lefschetz number of homeomorphisms on punctured disks
We compute the generalized Lefschetz number of orientation-preserving selfhomeomorphisms of a compact punctured disk, using the fact that homotopy classes of these homeomorphisms can be identified with braids. This result is applied to study Nielsen-Thurston canonical homeomorphisms on a punctured disk. We determine, for a certain class of braids, the rotation number of the corresponding canoni...
متن کامل2 Sang
Given two pseudo-Anosov homeomorphisms with distinct invariant measured foliations, some powers of their isotopy classes generate a rank two free subgroup of the mapping class group of the surface [6]. This construction gives an example of all pseudo-Anosov subgroup of the mapping class group. Whittlesey [13] gives a positive answer to the natural question of the existence of all pseudo-Anosov ...
متن کاملVassiliev invariants for braids on surfaces
We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit an universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the considered surface. 1 Definitions and statements 1.
متن کاملConvergence of Handle Reduction of Braids
We give a proof for the convergence of the handle reduction algorithm of braids that is both more simple and more precise than the ones of [2] or [3]. The prerequisites are Garside’s theory of positive braids, and one technical result about Artin’s representation of braids available in chapter V
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003